Using Procedural Parameters and Continuations in Combinatorial Searches

INTRODUCTION Procedural parameters in the imperative paradigm are hardly exploited in computing literature. Among the rare examples, Allison used procedural parameters to represent continuations, and van Eijk employed procedural parameters in generating all paths from the root of a binary tree to each of its leaves. To fertilize the field of procedural parameters, this note presents a use of procedural parameters to cut away unwanted branches in a search tree. The technique is based on that of van Eijk, and may be illustrated by a couple of examples.